Strongest Evidence: Maximum Apparent Phylogenetic Signal as a New Cladistic Optimality Criterion

نویسنده

  • Benjamin A. Salisbury
چکیده

A new method for phylogenetic inference, Strongest Evidence (SE), is described. In this method, a character’s support for a phylogenetic hypothesis, its apparent phylogenetic signal, is greatest when the amount of implied homoplasy is most remarkably small given background knowledge alone. Because evolutionary rates are not assumed to be slow, background expectations for character length can be derived through modeling complete dissociation between branching pattern and character state assignments. As in unweighted parsimony, SE holds that fewer required evolutionary steps in a character indicates stronger support for a tree. However, in SE, the relationship between steps and support differs by unlabeled tree topology and character state distribution. Strongest evidence is contrasted in detail with both unweighted parsimony and Goloboff’s method of implied weights. An iterative process is suggested for incrementally resolving a phylogenetic hypothesis while conducting cladistic analyses at increasingly local levels. q 1999

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relative apparent synapomorphy analysis (RASA). I: The statistical measurement of phylogenetic signal.

We have developed a new approach to the measurement of phylogenetic signal in character state matrices called relative apparent synapomorphy analysis (RASA). RASA provides a deterministic, statistical measure of natural cladistic hierarchy (phylogenetic signal) in character state matrices. The method works by determining whether a measure of the rate of increase of cladistic similarity among pa...

متن کامل

Molecular systematics of terraranas (Anura: Brachycephaloidea) with an assessment of the effects of alignment and optimality criteria.

Brachycephaloidea is a monophyletic group of frogs with more than 1000 species distributed throughout the New World tropics, subtropics, and Andean regions. Recently, the group has been the target of multiple molecular phylogenetic analyses, resulting in extensive changes in its taxonomy. Here, we test previous hypotheses of phylogenetic relationships for the group by combining available molecu...

متن کامل

Constructing Camin-Sokal Phylogenies Via Answer Set Programming

The problem of constructing a most parsimonious phylogenetic tree from species data, the maximum parsimony problem, is central to phylogenetics and has diverse applications elsewhere. Most natural variations of the problem, including the cladistic Camin-Sokal (CCS) version studied here, are NP-complete. The usual approach to solving these problems is branch-and-bound (BNB); packages using BNB o...

متن کامل

Cheilanthoid Ferns (Pteridaceae: Cheilanthoideae) in the Southwestern United States and Adjacent Mexico-A Molecular Phylogenetic Reassessment of Generic Lines

Cheilanthoids are the most commonly encountered fe rn species of the arid southwest and other xeric habitats throughout the world. Cheilanthes, Notholaena, Pellaea, and Bommeria are the best known southwestern genera, but some authors recognize segregate genera such as Argyrochosma, Aspidotis, Astrolepis, and Pentagramma. Others reject distinctions among some of these genera as artificial , lea...

متن کامل

Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion

A basic problem in molecular biology is to rebuild phylogenetic trees from a set of DNA or protein sequences. Among different criteria used for this purpose, the minimum evolution criterion is an optimality based criterion aiming to rebuild phylogenetic trees characterized by a minimal length. This problem is known to be NP-hard. We introduce in this paper some mixed integer programming models,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999